Tree traversal - PDFSEARCH.IO - Document Search Engine

Tree traversal
Results: 307

#	Item
181	Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as Add to Reading List Source URL: ftp.cs.umd.edu Language: English - Date: 1999-03-05 16:45:12 Computer programming Skip list Linked list Splay tree Binary search tree Tree traversal Self-balancing binary search tree Treap Quicksort Binary trees Graph theory Computing
182	Query Translation from XPath to SQL in the Presence of Recursive DTDs Wenfei Fan† ∗ Jeffrey Xu Yu‡ Add to Reading List Source URL: www.vldb2005.org Language: English - Date: 2005-08-02 11:17:32 Computer languages XML Markup languages SQL XPath XQuery Dynamic programming Microsoft SQL Server Tree traversal Computing Query languages Relational database management systems
183	Suffix Trays and Suffix Trists: Structures for Faster Text Indexing Richard Cole1 and Tsvi Kopelowitz2 Moshe Lewenstein2 1 New York University Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2008-01-16 14:41:53 Binary trees Suffix tree B-tree Suffix array String Binary search tree Tree traversal Trie Generalised suffix tree Computing Graph theory Computer programming
184	A Calculational Approach to Program Inversion Shin-Cheng Mu Linacre College 23rd January 2003 Add to Reading List Source URL: www.iis.sinica.edu.tw Language: English - Date: 1969-12-31 19:00:00 Operations research Mathematical optimization Mathematical logic Analysis of algorithms Algorithm RSA Dynamic programming Tree traversal Time complexity Mathematics Theoretical computer science Applied mathematics
185	Robust Execution of Contingent, Temporally Flexible Plans Add to Reading List Source URL: www.aaai.org Language: English - Date: 2006-07-09 01:49:28 Search algorithms Tree traversal Bellman–Ford algorithm Distributed computing Depth-first search Tree Connectivity Bridge Shortest path problem Mathematics Graph theory Theoretical computer science
186	Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents ∗ Songting Chen1 , Hua-Gang Li2 , Junichi Tatemura1 Wang-Pin Hsiung1 , Divyakant Agrawal1 , K. Selc¸uk Candan1 Add to Reading List Source URL: www.vldb.org Language: English - Date: 2006-09-05 10:19:41 Stack Tree traversal Bin XQuery Dc B-tree XML XPath Computing Markup languages Technical communication
187	A Shortcut Fusion Rule for Circular Program Calculation Jo˜ao Paulo Fernandes ∗ Alberto Pardo Jo˜ao Saraiva Add to Reading List Source URL: www.fing.edu.uy Language: English - Date: 2007-07-31 11:45:54 Higher-order functions Map Tree traversal Continuous function Fold Anamorphism Monad Software engineering Declarative programming Computing
188	The Boundary Forest Algorithm for online supervised and unsupervised learning Charles Mathy Nate Derbinsky Disney Research Boston Wentworth Institute of Technology Add to Reading List Source URL: www.disneyresearch.com Language: English - Date: 2015-01-19 20:27:41 Search algorithms R-tree K-d tree K-nearest neighbor algorithm Tree traversal Random forest Supervised learning Tango tree Interval tree Machine learning Artificial intelligence Mathematics
189	Proving Correctness of Highly-Concurrent Linearisable Objects Viktor Vafeiadis Maurice Herlihy∗ Computer Laboratory, University of Cambridge Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2007-04-11 12:16:47 Data management Monitor Tree traversal Parallel computing B-tree Linearizability Mutual exclusion Non-blocking algorithm Thread Concurrency control Computing Computer programming
190	Online Identification of Hierarchical Heavy Hitters: Algorithms, Evaluation, and Applications Yin Zhang? Sumeet Singh§ Subhabrata Sen? Nick Duffield? Carsten Lund? AT&T Labs – Research, Florham Park, NJ 07932, USA? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2004-10-23 00:21:56 Routing Tree Transmission Control Protocol Computer programming Associative arrays Hashing Radix tree Luleå algorithm Computing Trie Tree traversal

UPDATE